Dividing a Graph into Triconnected Components
نویسندگان
چکیده
منابع مشابه
Finding Triconnected Components by Local Replacement 1
We present a parallel algorithm for nding triconnected components on a CRCW PRAM. The time complexity of our algorithm is O(log n) and the processor-time product is O((m + n) log log n) where n is the number of vertices, and m is the number of edges of the input graph. Our algorithm, like other parallel algorithms for this problem, is based on open ear decomposition but it employs a new techniq...
متن کاملFinding Triconnected Components by Local Replacements
We present a parallel algorithm for nding triconnected components on a CRCW PRAM. The time complexity of our algorithm is O(logn) and the processor-time product is O((m + n) log logn) where n is the number of vertices, and m is the number of edges of the input graph. Our algorithm, like other parallel algorithms for this problem, is based on open ear decomposition but it employs a new technique...
متن کاملA heuristic approach for dividing graphs into bi-connected components with a size constraint
In this paper we propose a new problem of finding the maximal biconnected partitioning of a graph with a size constraint (MBCPG-SC). With the goal of finding approximate solutions for the MBCPG-SC, a heuristic method is developed based on the open ear decomposition of graphs. Its essential part is an adaptation of the breadth first search which makes it possible to grow bi-connected subgraphs. ...
متن کاملDividing a system into almost unidirectional blocks
When a system is divided into blocks B 1 B2..Bk..B m such that the existence of failure in B k will not interfare required performance of blocks B 1 B2... and Bk_l, then these blocks are called unidirectional blocks. To determine failure elements in a system, unidirectional blocks B 1 B2... will be tested one by one in the order to find a block containin~ failure first, then diagnose the block ...
متن کاملDecomposing the Web Graph into Parameterized Connected Components
We propose a novel method for Web page grouping based only on hyperlink information. Because of the explosive growth of the World Wide Web, page grouping is expected to provide a general grasp of the Web for effective information search and netsurfing. The Web can be regarded as a gigantic digraph where pages are vertices and links are arcs. Our grouping method is a generalization of decomposit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1973
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0202012